An Approximate Scheme of Oblivious Transfer with Probabilistic Receipt

An efficient scheme is proposed which achieves the oblivious transfer with probabilistic receipt, α-OT, approximately for 0 < α < 1. The proposed scheme approximates α-OT with 2−i-OT for i = 1, 2, . . . , k. It implements γ-OT for some γ such that (α − 2−k)/(1 − 2−k) < γ ≤ α with − log(1 − α) invocations of 2−1-OT and at most 2 invocations of 2−i-OT for each i = 2, . . . , k. These invocations can be executed in parallel. key words: oblivious transfer, approximation